Synchronized Regular Expressions1 1An extended version of this paper is considered for publication in Acta Informatica

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

This is the Author Version of a Paper Published as:

Discusses the relation between cybernetics and architecture and pays tribute to Gordon Pask’s role and influence. Indicates Pask’s contribution to an increasingly environmentally responsive architectural theory that may lead to a more humane and ecologically conscious environment.

متن کامل

Acta Mathematica et Informatica Universitatis Ostraviensis

1. I n t r o d u c t i o n In 1640, Pierre de Fermat conjectured that all numbers F m = 2 2 ' " + 1 for m = 0, 1, 2 , . . . , (1) are prime, which was later found to be incorrect. The numbers Fm are called Fermat numbers after him. If Fm is prime, we say that it is a Fermat prime. Until the end of the 18th century, Fermat numbers were most likely a mathe­ matical curiosity. The interest in the ...

متن کامل

Review of the Journal Acta Informatica Medica in 2013

First issue of Acta Informatica Medica journal was published during wartime in Bosnia and Herzegovina (in 1993). Until 2006 journal is published in Bosnian and English language 4 times per year, then only in English. From this year journal is printing bimonthly. In the year 2013 Acta Informatica Medica journal has published a total of 66 articles. Submission was carried out only electronically ...

متن کامل

A Complete Bibliography of Publications in Acta Informatica

(n, k) [370]. (N − 1) [1203]. + [1117, 903]. 0 [349, 852]. 1 [32, 939, 293, 778, 516, 916, 607, 563, 548, 946, 231, 852, 578]. 1, 1 [488]. 2 [1234, 1246, 737, 714, 715, 313, 788, 92, 166, 202]. 2.5n [535]. 3 [1234, 313, 92, 202]. 7 [1141]. ∗ [466]. α− β [235]. α2 [1355]. B [515]. B∗ [442]. B [680]. mod5 [1141]. P [1090]. QH [1090]. D [1209, 401, 136, 1078, 1017, 1185]. DTIMEF(F) =?DSPACEF(F) [1...

متن کامل

This is the title of this paper

1. The network topology is characterized in the language of graph theory (e.g. tree, 0-chain, 1-chain) [1] [2]. By this means, the set of steady-state fluxes can be parameterized explicitly. 2. A particular steady-state solution is selected. This steady-state solution is used to generate a nominal, stationary routing algorithm for the stochastic flow problem. 3. However, to ensure the network o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2002

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(04)00327-5